Pre-computation based selective probing (PCSP) scheme with imprecise state information
نویسندگان
چکیده
In this paper, we extend the recently presented QoS routing scheme called Pre-Computation based Selective Probing(PCSP) to the practical environment where the state information available for the routing decision is not precise. This extended PCSP algorithm pre-computes the QoS variations as well as the cost and QoS metrics of the least-cost and bestquality paths, taking into account the impreciseness of state information. The pre-computed information enables to strictly limit the set of neighbor nodes involved in the probing process, thereby reducing the message complexity without sacrificing cost optimality. This extended PCSP scheme encompasses the original PCSP scheme as a special case where the variation of state information reduces to zero. Computer simulation reveals that the extended PCSP scheme maintains low message complexity and high success ratio with guaranteed optimal search.
منابع مشابه
Distributed QoS Routing with Imprecise State Information
The goal of Quality-of-Service (QoS) routing is to find a network path which has suficient resources to satisfy certain constraints on delay, bandwidth and/or other metrics. The network state information maintained at every node is often imprecise in a dynamic environment because of nonnegligible propagation delay of state messages, periodic updates due to overhead concern, and hierarchical sta...
متن کاملOn Fixed Priority Preemptive Scheduling for Imprecise Computation
We present new results in fixed priority scheduling for imprecise computation in real-time systems. Imprecise computation has not been popularized enough for reasons which are rooted from the task model, scheduling methods (EDF-based) and general system support. Audsley et al. have devised schedulability tests for guaranteeing mandatory computation while incorporating unbounded optional compone...
متن کاملA reinforcement learning ticket-based probing path discovery scheme for MANETs
In this paper, a path discovery scheme which supports QoS routing in mobile ad hoc networks (MANETs) in the presence of imprecise information is investigated. The aim is to increase the probability of success in finding feasible paths and reduce average path cost of a previously proposed ticket based probing (TBP) path discovery scheme. The proposed scheme integrates the original TBP scheme wit...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملApproximation Schemes for Information Acquisition and Exploitation in Multichannel Wireless Networks
Nodes in future wireless networks are likely to have access to multiple channels. A node can learn the instantaneous state of a channel only by probing it which in turn consumes both additional energy and time. A node therefore needs to not only optimally select the channel based on available information but also optimally determine the amount of information it should acquire about the instanta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001